Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
نویسندگان
چکیده
The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
منابع مشابه
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
متن کاملComplexity of the Guarded Two-Variable Fragment with Counting Quantifiers
We show that the finite satisfiability problem for the guarded twovariable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of the result obtained in Kazakov [6], that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
متن کاملOne-dimensional Fragment of First-order Logic
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified formula. The fragment is closed under Boolean operations, but additional restrictions (called uniformity conditions) apply to combin...
متن کاملOn the complexity of the two-variable guarded fragment with transitive guards
We investigate the complexity of the satisfiability problem for the two-variable guarded fragment with transitive guards.We prove that the satisfiability problem for the monadic version of this logic without equality is 2EXPTIME-hard. It is in fact 2EXPTIME-complete, since as shown by Szwast and Tendera, the whole guarded fragment with transitive guards is in 2EXPTIME.We also introduce a new lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 13 شماره
صفحات -
تاریخ انتشار 2017